Zero skew clock routing for fast clock tree generation
نویسندگان
چکیده
منابع مشابه
An Algorithm for Zero-Skew Clock Tree Routing with Bu er Insertion
We study the problem of multi-stage zero skew clock tree construction for minimizing clock phase delay and wirelength. In existing approaches clock bu ers are inserted only after clock tree is constructed. The novelty of this paper lies in simultaneously perform clock tree routing and bu er insertion. We propose a clustering-based algorithm which uses shortest delay as the cost function. We sho...
متن کاملZero-Skew Clock Routing Trees With Minimum Wirelength
In the design of high performance VLSI systems, minimization of clock skew is an increasingly important objective. Additionally, wirelength of clock routing trees should be minimized in order to reduce system power requirements and deformation of the clock pulse at the synchronizing elements of the system. In this paper, we present the Deferred-Merge Embedding (DME) algorithm, which in linear t...
متن کاملPlanar-DME: a single-layer zero-skew clock tree router
This paper presents new single-layer, i.e., planar-embeddable, clock tree constructions with exact zero skew under either the linear or the Elmore delay model. Our method, called Planar-DME, consists of two parts. The rst algorithm, called Linear-Planar-DME, guarantees an optimal planar zero-skew clock tree (ZST) under the linear delay model. The second algorithm, called ElmorePlanar-DME, uses ...
متن کاملMinimum Wirelength Zero Skew Clock Routing Trees with Buffer Insertion
Zero skew clock routing is an issue of increasing importance in the realm of VLSI design. As a result of the increasing speeds of on-chip clocks, zero skew clock tree construction has become critical for the correct operation of high performance VLSI circuits. In addition, in an effort to both reduce power consumption and the deformation of clock signals at synchronizing elements on a chip, a m...
متن کاملPractical Bounded-Skew Clock Routing
In Clock routing research, such practical considerations as hierarchical buffering, rise-time and overshoot constraints, obstacleand legal location-checking, varying layer parasitics and congestion, and even the underlying design flow are often ignored. This paper explores directions in which traditional formulations can be extended so that the resulting algorithms are more useful in production...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The International Conference on Electrical Engineering
سال: 2008
ISSN: 2636-4441
DOI: 10.21608/iceeng.2008.34322